TSTP Solution File: PUZ081^3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : PUZ081^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 08:49:07 EDT 2024

% Result   : Theorem 0.10s 0.34s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10  % Problem    : PUZ081^3 : TPTP v8.1.2. Released v3.6.0.
% 0.08/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31  % Computer : n012.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Fri May  3 18:10:22 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.32  This is a TH0_THM_NEQ_NAR problem
% 0.10/0.32  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.fPUivZYEeK/Vampire---4.8_9223
% 0.10/0.33  % (9336)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.10/0.33  % (9333)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.10/0.33  % (9339)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.10/0.33  % (9337)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.10/0.33  % (9334)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.10/0.33  % (9338)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.10/0.33  % (9336)Instruction limit reached!
% 0.10/0.33  % (9336)------------------------------
% 0.10/0.33  % (9336)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33  % (9336)Termination reason: Unknown
% 0.10/0.33  % (9336)Termination phase: Saturation
% 0.10/0.33  
% 0.10/0.33  % (9336)Memory used [KB]: 895
% 0.10/0.33  % (9336)Time elapsed: 0.003 s
% 0.10/0.33  % (9336)Instructions burned: 2 (million)
% 0.10/0.33  % (9336)------------------------------
% 0.10/0.33  % (9336)------------------------------
% 0.10/0.33  % (9335)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.10/0.33  % (9337)Instruction limit reached!
% 0.10/0.33  % (9337)------------------------------
% 0.10/0.33  % (9337)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33  % (9337)Termination reason: Unknown
% 0.10/0.33  % (9337)Termination phase: Property scanning
% 0.10/0.33  
% 0.10/0.33  % (9337)Memory used [KB]: 895
% 0.10/0.33  % (9337)Time elapsed: 0.002 s
% 0.10/0.33  % (9337)Instructions burned: 2 (million)
% 0.10/0.33  % (9337)------------------------------
% 0.10/0.33  % (9337)------------------------------
% 0.10/0.33  % (9340)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.10/0.33  % (9338)Refutation not found, incomplete strategy
% 0.10/0.33  % (9338)------------------------------
% 0.10/0.33  % (9338)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.33  % (9338)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.33  
% 0.10/0.33  
% 0.10/0.33  % (9338)Memory used [KB]: 5500
% 0.10/0.33  % (9338)Time elapsed: 0.003 s
% 0.10/0.33  % (9338)Instructions burned: 2 (million)
% 0.10/0.33  % (9338)------------------------------
% 0.10/0.33  % (9338)------------------------------
% 0.10/0.34  % (9334)Instruction limit reached!
% 0.10/0.34  % (9334)------------------------------
% 0.10/0.34  % (9334)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34  % (9334)Termination reason: Unknown
% 0.10/0.34  % (9334)Termination phase: Saturation
% 0.10/0.34  
% 0.10/0.34  % (9334)Memory used [KB]: 5500
% 0.10/0.34  % (9334)Time elapsed: 0.004 s
% 0.10/0.34  % (9334)Instructions burned: 4 (million)
% 0.10/0.34  % (9334)------------------------------
% 0.10/0.34  % (9334)------------------------------
% 0.10/0.34  % (9340)Instruction limit reached!
% 0.10/0.34  % (9340)------------------------------
% 0.10/0.34  % (9340)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34  % (9340)Termination reason: Unknown
% 0.10/0.34  % (9340)Termination phase: Saturation
% 0.10/0.34  
% 0.10/0.34  % (9340)Memory used [KB]: 5500
% 0.10/0.34  % (9340)Time elapsed: 0.004 s
% 0.10/0.34  % (9340)Instructions burned: 3 (million)
% 0.10/0.34  % (9340)------------------------------
% 0.10/0.34  % (9340)------------------------------
% 0.10/0.34  % (9339)First to succeed.
% 0.10/0.34  % (9333)Also succeeded, but the first one will report.
% 0.10/0.34  % (9339)Refutation found. Thanks to Tanya!
% 0.10/0.34  % SZS status Theorem for Vampire---4
% 0.10/0.34  % SZS output start Proof for Vampire---4
% 0.10/0.34  thf(func_def_2, type, knight: $i > $o).
% 0.10/0.34  thf(func_def_3, type, knave: $i > $o).
% 0.10/0.34  thf(func_def_4, type, says: $i > $o > $o).
% 0.10/0.34  thf(func_def_11, type, ph1: !>[X0: $tType]:(X0)).
% 0.10/0.34  thf(f106,plain,(
% 0.10/0.34    $false),
% 0.10/0.34    inference(avatar_sat_refutation,[],[f44,f61,f70,f81,f105])).
% 0.10/0.34  thf(f105,plain,(
% 0.10/0.34    ~spl0_1 | ~spl0_3),
% 0.10/0.34    inference(avatar_contradiction_clause,[],[f104])).
% 0.10/0.34  thf(f104,plain,(
% 0.10/0.34    $false | (~spl0_1 | ~spl0_3)),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f100])).
% 0.10/0.34  thf(f100,plain,(
% 0.10/0.34    ($true != $true) | (~spl0_1 | ~spl0_3)),
% 0.10/0.34    inference(superposition,[],[f98,f65])).
% 0.10/0.34  thf(f65,plain,(
% 0.10/0.34    ($true = (says @ zoey @ $true)) | ~spl0_3),
% 0.10/0.34    inference(avatar_component_clause,[],[f63])).
% 0.10/0.34  thf(f63,plain,(
% 0.10/0.34    spl0_3 <=> ($true = (says @ zoey @ $true))),
% 0.10/0.34    introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.10/0.34  thf(f98,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (($true != (says @ X0 @ $true))) ) | ~spl0_1),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f91])).
% 0.10/0.34  thf(f91,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (($true != $true) | ($true != (says @ X0 @ $true))) ) | ~spl0_1),
% 0.10/0.34    inference(backward_demodulation,[],[f35,f90])).
% 0.10/0.34  thf(f90,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knave @ X0) = $true)) ) | ~spl0_1),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f88])).
% 0.10/0.34  thf(f88,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knave @ X0) = $true) | ($true = $false)) ) | ~spl0_1),
% 0.10/0.34    inference(backward_demodulation,[],[f36,f84])).
% 0.10/0.34  thf(f84,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) = $false)) ) | ~spl0_1),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f82])).
% 0.10/0.34  thf(f82,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) = $false) | ($true != $true)) ) | ~spl0_1),
% 0.10/0.34    inference(superposition,[],[f40,f52])).
% 0.10/0.34  thf(f52,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) = $true) | ((knight @ X0) = $false)) )),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f49])).
% 0.10/0.34  thf(f49,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) = $true) | ((knight @ X0) = $false) | ($true = $false)) )),
% 0.10/0.34    inference(superposition,[],[f37,f36])).
% 0.10/0.34  thf(f37,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knave @ X0) = $false) | ((knight @ X0) = $false)) )),
% 0.10/0.34    inference(binary_proxy_clausification,[],[f32])).
% 0.10/0.34  thf(f32,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) != (knave @ X0))) )),
% 0.10/0.34    inference(cnf_transformation,[],[f20])).
% 0.10/0.34  thf(f20,plain,(
% 0.10/0.34    ! [X0] : ((knight @ X0) != (knave @ X0))),
% 0.10/0.34    inference(fool_elimination,[],[f19])).
% 0.10/0.34  thf(f19,plain,(
% 0.10/0.34    ! [X0] : ((knave @ X0) <~> (knight @ X0))),
% 0.10/0.34    inference(rectify,[],[f1])).
% 0.10/0.34  thf(f1,axiom,(
% 0.10/0.34    ! [X0] : ((knave @ X0) <~> (knight @ X0))),
% 0.10/0.34    file('/export/starexec/sandbox2/tmp/tmp.fPUivZYEeK/Vampire---4.8_9223',knights_xor_knaves)).
% 0.10/0.34  thf(f40,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) != $true)) ) | ~spl0_1),
% 0.10/0.34    inference(avatar_component_clause,[],[f39])).
% 0.10/0.34  thf(f39,plain,(
% 0.10/0.34    spl0_1 <=> ! [X0] : ((knight @ X0) != $true)),
% 0.10/0.34    introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.10/0.34  thf(f36,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knave @ X0) = $true) | ((knight @ X0) = $true)) )),
% 0.10/0.34    inference(binary_proxy_clausification,[],[f32])).
% 0.10/0.34  thf(f35,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knave @ X0) != $true) | ($true != (says @ X0 @ $true))) )),
% 0.10/0.34    inference(equality_resolution,[],[f33])).
% 0.10/0.34  thf(f33,plain,(
% 0.10/0.34    ( ! [X0 : $i,X1 : $o] : (($true != X1) | ((knave @ X0) != $true) | ((says @ X0 @ X1) != $true)) )),
% 0.10/0.34    inference(cnf_transformation,[],[f25])).
% 0.10/0.34  thf(f25,plain,(
% 0.10/0.34    ! [X0,X1 : $o] : (($true != X1) | ((knave @ X0) != $true) | ((says @ X0 @ X1) != $true))),
% 0.10/0.34    inference(flattening,[],[f24])).
% 0.10/0.34  thf(f24,plain,(
% 0.10/0.34    ! [X0,X1 : $o] : (($true != X1) | (((says @ X0 @ X1) != $true) | ((knave @ X0) != $true)))),
% 0.10/0.34    inference(ennf_transformation,[],[f21])).
% 0.10/0.34  thf(f21,plain,(
% 0.10/0.34    ! [X0,X1 : $o] : ((((says @ X0 @ X1) = $true) & ((knave @ X0) = $true)) => ($true != X1))),
% 0.10/0.34    inference(flattening,[],[f16])).
% 0.10/0.34  thf(f16,plain,(
% 0.10/0.34    ! [X0,X1 : $o] : ((((says @ X0 @ X1) = $true) & ((knave @ X0) = $true)) => ~($true = X1))),
% 0.10/0.34    inference(fool_elimination,[],[f15])).
% 0.10/0.34  thf(f15,plain,(
% 0.10/0.34    ! [X0,X1 : $o] : (((knave @ X0) & (says @ X0 @ X1)) => ~X1)),
% 0.10/0.34    inference(rectify,[],[f3])).
% 0.10/0.34  thf(f3,axiom,(
% 0.10/0.34    ! [X0,X1 : $o] : (((knave @ X0) & (says @ X0 @ X1)) => ~X1)),
% 0.10/0.34    file('/export/starexec/sandbox2/tmp/tmp.fPUivZYEeK/Vampire---4.8_9223',knaves_lie)).
% 0.10/0.34  thf(f81,plain,(
% 0.10/0.34    ~spl0_1 | ~spl0_4),
% 0.10/0.34    inference(avatar_contradiction_clause,[],[f80])).
% 0.10/0.34  thf(f80,plain,(
% 0.10/0.34    $false | (~spl0_1 | ~spl0_4)),
% 0.10/0.34    inference(subsumption_resolution,[],[f69,f40])).
% 0.10/0.34  thf(f69,plain,(
% 0.10/0.34    ((knight @ mel) = $true) | ~spl0_4),
% 0.10/0.34    inference(avatar_component_clause,[],[f67])).
% 0.10/0.34  thf(f67,plain,(
% 0.10/0.34    spl0_4 <=> ((knight @ mel) = $true)),
% 0.10/0.34    introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.10/0.34  thf(f70,plain,(
% 0.10/0.34    spl0_3 | spl0_4),
% 0.10/0.34    inference(avatar_split_clause,[],[f55,f67,f63])).
% 0.10/0.34  thf(f55,plain,(
% 0.10/0.34    ((knight @ mel) = $true) | ($true = (says @ zoey @ $true))),
% 0.10/0.34    inference(superposition,[],[f29,f36])).
% 0.10/0.34  thf(f29,plain,(
% 0.10/0.34    ((says @ zoey @ (knave @ mel)) = $true)),
% 0.10/0.34    inference(cnf_transformation,[],[f12])).
% 0.10/0.34  thf(f12,plain,(
% 0.10/0.34    ((says @ zoey @ (knave @ mel)) = $true)),
% 0.10/0.34    inference(fool_elimination,[],[f11])).
% 0.10/0.34  thf(f11,plain,(
% 0.10/0.34    (says @ zoey @ (knave @ mel))),
% 0.10/0.34    inference(rectify,[],[f4])).
% 0.10/0.34  thf(f4,axiom,(
% 0.10/0.34    (says @ zoey @ (knave @ mel))),
% 0.10/0.34    file('/export/starexec/sandbox2/tmp/tmp.fPUivZYEeK/Vampire---4.8_9223',zoey_speaks)).
% 0.10/0.34  thf(f61,plain,(
% 0.10/0.34    ~spl0_2),
% 0.10/0.34    inference(avatar_contradiction_clause,[],[f60])).
% 0.10/0.34  thf(f60,plain,(
% 0.10/0.34    $false | ~spl0_2),
% 0.10/0.34    inference(subsumption_resolution,[],[f57,f43])).
% 0.10/0.34  thf(f43,plain,(
% 0.10/0.34    ( ! [X1 : $i] : (($true != (knave @ X1))) ) | ~spl0_2),
% 0.10/0.34    inference(avatar_component_clause,[],[f42])).
% 0.10/0.34  thf(f42,plain,(
% 0.10/0.34    spl0_2 <=> ! [X1] : ($true != (knave @ X1))),
% 0.10/0.34    introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.10/0.34  thf(f57,plain,(
% 0.10/0.34    ((knave @ mel) = $true) | ~spl0_2),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f56])).
% 0.10/0.34  thf(f56,plain,(
% 0.10/0.34    ($true != $true) | ((knave @ mel) = $true) | ~spl0_2),
% 0.10/0.34    inference(superposition,[],[f48,f29])).
% 0.10/0.34  thf(f48,plain,(
% 0.10/0.34    ( ! [X0 : $o,X1 : $i] : (($true != (says @ X1 @ X0)) | ($true = X0)) ) | ~spl0_2),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f47])).
% 0.10/0.34  thf(f47,plain,(
% 0.10/0.34    ( ! [X0 : $o,X1 : $i] : (($true != $true) | ($true = X0) | ($true != (says @ X1 @ X0))) ) | ~spl0_2),
% 0.10/0.34    inference(backward_demodulation,[],[f30,f46])).
% 0.10/0.34  thf(f46,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) = $true)) ) | ~spl0_2),
% 0.10/0.34    inference(trivial_inequality_removal,[],[f45])).
% 0.10/0.34  thf(f45,plain,(
% 0.10/0.34    ( ! [X0 : $i] : (((knight @ X0) = $true) | ($true != $true)) ) | ~spl0_2),
% 0.10/0.34    inference(superposition,[],[f43,f36])).
% 0.10/0.34  thf(f30,plain,(
% 0.10/0.34    ( ! [X0 : $o,X1 : $i] : (($true = X0) | ($true != (knight @ X1)) | ($true != (says @ X1 @ X0))) )),
% 0.10/0.34    inference(cnf_transformation,[],[f27])).
% 0.10/0.34  thf(f27,plain,(
% 0.10/0.34    ! [X0 : $o,X1] : (($true != (says @ X1 @ X0)) | ($true = X0) | ($true != (knight @ X1)))),
% 0.10/0.34    inference(rectify,[],[f23])).
% 0.10/0.34  thf(f23,plain,(
% 0.10/0.34    ! [X1 : $o,X0] : (((says @ X0 @ X1) != $true) | ($true = X1) | ((knight @ X0) != $true))),
% 0.10/0.34    inference(flattening,[],[f22])).
% 0.10/0.34  thf(f22,plain,(
% 0.10/0.34    ! [X1 : $o,X0] : (($true = X1) | (((knight @ X0) != $true) | ((says @ X0 @ X1) != $true)))),
% 0.10/0.34    inference(ennf_transformation,[],[f18])).
% 0.10/0.34  thf(f18,plain,(
% 0.10/0.34    ! [X1 : $o,X0] : ((((knight @ X0) = $true) & ((says @ X0 @ X1) = $true)) => ($true = X1))),
% 0.10/0.34    inference(fool_elimination,[],[f17])).
% 0.10/0.34  thf(f17,plain,(
% 0.10/0.34    ! [X0,X1 : $o] : (((knight @ X0) & (says @ X0 @ X1)) => X1)),
% 0.10/0.34    inference(rectify,[],[f2])).
% 0.10/0.34  thf(f2,axiom,(
% 0.10/0.34    ! [X0,X1 : $o] : (((knight @ X0) & (says @ X0 @ X1)) => X1)),
% 0.10/0.34    file('/export/starexec/sandbox2/tmp/tmp.fPUivZYEeK/Vampire---4.8_9223',knights_tell_truth)).
% 0.10/0.34  thf(f44,plain,(
% 0.10/0.34    spl0_1 | spl0_2),
% 0.10/0.34    inference(avatar_split_clause,[],[f31,f42,f39])).
% 0.10/0.34  thf(f31,plain,(
% 0.10/0.34    ( ! [X0 : $i,X1 : $i] : (((knight @ X0) != $true) | ($true != (knave @ X1))) )),
% 0.10/0.34    inference(cnf_transformation,[],[f28])).
% 0.10/0.34  thf(f28,plain,(
% 0.10/0.34    ! [X0,X1] : (($true != (knave @ X1)) | ((knight @ X0) != $true))),
% 0.10/0.34    inference(rectify,[],[f26])).
% 0.10/0.34  thf(f26,plain,(
% 0.10/0.34    ! [X1,X0] : (((knave @ X0) != $true) | ($true != (knight @ X1)))),
% 0.10/0.34    inference(ennf_transformation,[],[f10])).
% 0.10/0.34  thf(f10,plain,(
% 0.10/0.34    ~? [X0,X1] : (((knave @ X0) = $true) & ($true = (knight @ X1)))),
% 0.10/0.34    inference(fool_elimination,[],[f9])).
% 0.10/0.34  thf(f9,plain,(
% 0.10/0.34    ~? [X0,X1] : ((knave @ X0) & (knight @ X1))),
% 0.10/0.34    inference(rectify,[],[f7])).
% 0.10/0.34  thf(f7,negated_conjecture,(
% 0.10/0.34    ~? [X3,X2] : ((knave @ X3) & (knight @ X2))),
% 0.10/0.34    inference(negated_conjecture,[],[f6])).
% 0.10/0.34  thf(f6,conjecture,(
% 0.10/0.34    ? [X3,X2] : ((knave @ X3) & (knight @ X2))),
% 0.10/0.34    file('/export/starexec/sandbox2/tmp/tmp.fPUivZYEeK/Vampire---4.8_9223',who_is_knight_and_knave)).
% 0.10/0.34  % SZS output end Proof for Vampire---4
% 0.10/0.34  % (9339)------------------------------
% 0.10/0.34  % (9339)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34  % (9339)Termination reason: Refutation
% 0.10/0.34  
% 0.10/0.34  % (9339)Memory used [KB]: 5500
% 0.10/0.34  % (9339)Time elapsed: 0.006 s
% 0.10/0.34  % (9339)Instructions burned: 6 (million)
% 0.10/0.34  % (9339)------------------------------
% 0.10/0.34  % (9339)------------------------------
% 0.10/0.34  % (9331)Success in time 0.006 s
% 0.10/0.34  % Vampire---4.8 exiting
%------------------------------------------------------------------------------